Maximum modulus algebras and local approximation inCn

On the Structure of Maximum Modulus Algebras

i.e., if every fER attains its maximum modulus on C. As a matter of convenience, we shall, in this paper, abbreviate "maximum modulus algebra on K" to "ilf-algebra." Examples of Af-algebras which come to mind immediately are (a) the algebra ft consisting of all functions which are continuous on K and analytic in U, (b) any subalgebra of ft, (c) any algebra (B which is equivalent to an algebra o...

A Strong Maximum Modulus Theorem for Maximal Function Algebras

Local tracial C*-algebras

‎Let $Omega$ be a class of unital‎ ‎$C^*$-algebras‎. ‎We introduce the notion of a local tracial $Omega$-algebra‎. ‎Let $A$ be an $alpha$-simple unital local tracial $Omega$-algebra‎. ‎Suppose that $alpha:Gto $Aut($A$) is an action of a finite group $G$ on $A$‎ ‎which has a certain non-simple tracial Rokhlin property‎. ‎Then the crossed product algebra‎ ‎$C^*(G,A,alpha)$ is a unital local traci...

Linear Time Local Approximation Algorithm for Maximum Stable Marriage

We consider a two-sided market under incomplete preference lists with ties, where the goal is to find a maximum size stable matching. The problem is APX-hard, and a 3/2-approximation was given by McDermid [1]. This algorithm has a non-linear running time, and, more importantly needs global knowledge of all preference lists. We present a very natural, economically reasonable, local, linear time ...

A Local Computation Approximation Scheme to Maximum Matching

We present a polylogarithmic local computation matching algorithm which guarantees a (1−ǫ)-approximation to the maximum matching in graphs of bounded degree.